Labeled Traveling Salesman Problems: Complexity and approximation
نویسندگان
چکیده
منابع مشابه
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation and analyze approximation algorithms, for both versions of the problem. For the maximization version we give a 1 2 -approximation algorithm based on local i...
متن کاملOn Labeled Traveling Salesman Problems
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation, and analyze approximation algorithms for both versions of the problem. For the maximization version we give a 1 2 -approximation algorithm and show that it...
متن کاملComplexity and approximation for Traveling Salesman Problems with profits
In TSP with profits we have to find an optimal tour and a set of customers satisfying a specific constraint. In this paper we analyze three different variants of TSP with profits that are NP-hard in general. We study their computational complexity on special structures of the underlying graph, both in the case with and without service times to the customers. We present polynomial algorithms for...
متن کاملDifferential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP . We show that TSP is 2/3-differential approximable and can not be differential approximable greater than 649/650. Next, we demonstrate that, when dealing with edge-costs 1 and 2, the same algorithm idea improves this ratio to 3/4 and we obtain a differential non-approximation threshold equal to ...
متن کاملLP-Based Approximation Algorithms for Traveling Salesman Path Problems
We present a ( 3 − ǫ)-approximation algorithm for some constant ǫ > 0 for the traveling salesman path problem under the unit-weight graphical metric, and prove an upper bound on the integrality gap of the path-variant Held-Karp relaxation both under this metric and the general metric. Given a complete graph with the metric cost and two designated endpoints in the graph, the traveling salesman p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2010
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2010.02.003